Condition Graphs
نویسندگان
چکیده
A connection graph represents resolvability in a set of clauses explicitly. The corresponding connection graph proof procedure has the deeciency that the graphs may grow, becoming impractical to handle. We present a novel proof procedure for condition graphs, which is a reenement of connection graphs. Our idea is to control the growth of the graph by recognizing tests in clauses and translating them to restrictions on the resolvability of links. A link is not selected for resolution unless all its associated tests have been determined to be true. The condition graph proof procedure exploits the inherent parallelism in logic programs. We present a parallel logic programming language with appealing theoretical properties, which is executed eeciently using the condition graph proof procedure. An abstract parallel machine for the language is deened. A realization of the machine on the Connection Machine, a massively parallel computer, is outlined. 1. INTRODUCTION Our goal is to eeciently execute programs in an expressive logic programming language. One way is to make use of the inherent parallelism in logic programs. For this purpose we introduce condition graphs and an associated proof procedure. Theorems for basic theoretical properties of the proof procedure are presented. Only informal proofs are given, to keep this a short paper. We suggest a language, Uplog, to be the source for the condition graphs, although other languages could be considered as well, with minor modiication of the proof procedure. Throughout the work, a primary consideration has been the possibility to implement the system on a massively parallel computer, such as the Connection Machine.* Section 2 gives a brief introduction to connection graphs. Section 3 deenes condition graphs and the condition graph proof procedure. The Uplog language is introduced in section 4. The Condition Graph Inference Machine is deened in section 5. Finally section 6 contains a realization of the Condition Graph Inference Machine on the Connection Machine.
منابع مشابه
On the edge-connectivity of C_4-free graphs
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
متن کاملSome Algebraic and Combinatorial Properties of the Complete $T$-Partite Graphs
In this paper, we characterize the shellable complete $t$-partite graphs. We also show for these types of graphs the concepts vertex decomposable, shellable and sequentially Cohen-Macaulay are equivalent. Furthermore, we give a combinatorial condition for the Cohen-Macaulay complete $t$-partite graphs.
متن کاملOn Tensor Product of Graphs, Girth and Triangles
The purpose of this paper is to obtain a necessary and sufficient condition for the tensor product of two or more graphs to be connected, bipartite or eulerian. Also, we present a characterization of the duplicate graph $G 1 K_2$ to be unicyclic. Finally, the girth and the formula for computing the number of triangles in the tensor product of graphs are worked out.
متن کاملMORE GRAPHS WHOSE ENERGY EXCEEDS THE NUMBER OF VERTICES
The energy E(G) of a graph G is equal to the sum of the absolute values of the eigenvalues of G. Several classes of graphs are known that satisfy the condition E(G) > n , where n is the number of vertices. We now show that the same property holds for (i) biregular graphs of degree a b , with q quadrangles, if q<= abn/4 and 5<=a < b = 0 (iii) triregular graphs of degree 1, a, b that are quadran...
متن کاملOn the Graphs Related to Green Relations of Finite Semigroups
In this paper we develop an analog of the notion of the con- jugacy graph of nite groups for the nite semigroups by considering the Green relations of a nite semigroup. More precisely, by de ning the new graphs $Gamma_{L}(S)$, $Gamma_{H}(S)$, $Gamma_{J}(S)$ and $Gamma_{D}(S)$ (we name them the Green graphs) related to the Green relations L R J H and D of a nite semigroup S , we first atte...
متن کامل